Deterministic Algorithm Computing All Generators: Application in Cryptographic Systems Design
نویسندگان
چکیده
منابع مشابه
Improved Computing-Efficiency Least-Squares Algorithm with Application to All-Pass Filter Design
All-pass filter design can be generally achieved by solving a system of linear equations.The associatedmatrices involved in the set of linear equations can be further formulated as a Toeplitz-plus-Hankel form such that a matrix inversion is avoided. Consequently, the optimal filter coefficients can be solved by using computationally efficient Levinson algorithms or Cholesky decomposition techni...
متن کاملEvolving Cryptographic Pseudorandom Number Generators
Random number generators (RNGs) play an important role in many real-world applications. Besides true hardware RNGs, one important class are deterministic random number generators. Such generators do not possess the unpredictability of true RNGs, but still have a widespread usage. For a deterministic RNG to be used in cryptography, it needs to fulfill a number of conditions related to the speed,...
متن کاملDesign of a Hybrid Cryptographic Algorithm
Internet is a public-interacted system; the amount of information exchanged over the internet is completely not safe. Protecting the information transmitted over the network is a difficult task and the data security issues become increasingly important. At present, various types of cryptographic algorithms provide high security to information on networks, but there are also has some drawbacks. ...
متن کاملVLSI Design of Secure Cryptographic Algorithm
Light weight cryptography (LWC) is an emerging research area which has to deal with the trade-off among security, cost, and performance. In this paper we present the idea and list some types of LWC algorithms. Hummingbird is a novel ultra lightweight cryptographic algorithm targeted for resource constrained devices like RFID tags, smart cards and wireless sensor nodes. The hybrid model of Hummi...
متن کاملA RCA Approach to Design Cryptographic Algorithm
The paper presents a Reversible cellular automata based one dimensional cryptographic algorithm. This algorithm use specially selected reversible rules which are cryptographically secure and faster to compute. The strength and quality of the algorithm depends upon the rules used and the randomness of number used in the process of encryption and decryption. This algorithm also implements CA base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2012
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2012.511074